Inverse Eigenvalue Problems and Their Associated Approximation Problems for Matrices with J-(Skew) Centrosymmetry
نویسندگان
چکیده
The inverse problems play an important role in MEG reconstructions [3, 4, 5, 6, 7]. In this paper, a partially described inverse eigenvalue problem and an associated optimal approximation problem for J-centrosymmetric matrices are considered respectively. It is shown under which conditions the inverse eigenproblem has a solution. An expression of its general solution is given. In case a solution of the inverse eigenproblem exists, the optimal approximation problem can be solved. The formula of its unique solution is given. Also, the case for J-skew centrosymmetric matrices is considered.
منابع مشابه
A New Inexact Inverse Subspace Iteration for Generalized Eigenvalue Problems
In this paper, we represent an inexact inverse subspace iteration method for computing a few eigenpairs of the generalized eigenvalue problem Ax = Bx [Q. Ye and P. Zhang, Inexact inverse subspace iteration for generalized eigenvalue problems, Linear Algebra and its Application, 434 (2011) 1697-1715 ]. In particular, the linear convergence property of the inverse subspace iteration is preserved.
متن کاملOn the nonnegative inverse eigenvalue problem of traditional matrices
In this paper, at first for a given set of real or complex numbers $sigma$ with nonnegative summation, we introduce some special conditions that with them there is no nonnegative tridiagonal matrix in which $sigma$ is its spectrum. In continue we present some conditions for existence such nonnegative tridiagonal matrices.
متن کاملThe Solvability Conditions for the Inverse Eigenvalue Problem of Hermitian and Generalized Skew-Hamiltonian Matrices and Its Approximation
In this paper, we first consider the inverse eigenvalue problem as follows: Find a matrix A with specified eigen-pairs, where A is a Hermitian and generalized skewHamiltonian matrix. The sufficient and necessary conditions are obtained, and a general representation of such a matrix is presented. We denote the set of such matrices by LS . Then the best approximation problem for the inverse eigen...
متن کاملGeneralized inverse eigenvalue problems for symmetric arrow-head matrices
In this paper, we first give the representation of the general solution of the following inverse eigenvalue problem (IEP): Given X ∈ Rn×p and a diagonal matrix Λ ∈ Rp×p, find nontrivial real-valued symmetric arrow-head matrices A and B such that AXΛ = BX. We then consider an optimal approximation problem: Given real-valued symmetric arrow-head matrices Ã, B̃ ∈ Rn×n, find (Â, B̂) ∈ SE such that ‖Â...
متن کاملA Note on the Numerical Solution of Complex Hamiltonian and Skew-hamiltonian Eigenvalue Problems
In this paper we describe a simple observation that can be used to extend two recently proposed structure preserving methods for the eigenvalue problem for real Hamiltonian matrices to the case of complex Hamiltonian and skew-Hamiltonian matrices.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009